Description: 模拟退火算法解决旅行商问题，城市数量27，初始温度3000，温度衰减率0.95。
-Simulated annealing algorithm to solve the traveling salesman problem, 27 the number of cities, the initial temperature of 3000, the rate of temperature decay 0.95. Platform: |
Size: 2048 |
Author:yeon |
Hits:
Description: 使用模拟退火算法实现著名的旅行商问题，该压缩包中有完整的matlab源码和实验的截图。-Simulated annealing algorithm famous traveling salesman problem, the complete package includes shots of matlab source and the compression experiments. Platform: |
Size: 278528 |
Author:相知无悔 |
Hits:
Description: 1. 本程序使用模拟退火算法解决TSP问题
a) 初始温度确定方法
选取任意状态为初始状态。以1为起始温度，不断升温，直到模拟所得接受概率大于90 ；
b) 温度下降
温度下降系数为 0.95；
c) 每一温度迭代
选取固定迭代次数 100 * n；
d) 终止条件
温度下降次数到达 800，或某一温度下解不发生改变；
2. 本机运行及编译环境
win7 旗舰版 SP1
MINGW g++ 4.8.1
-Simulated Annealing Traveling Salesman Problem
1. This program uses the simulated annealing algorithm to solve TSP problem
a) determining the initial temperature method
Select any state to the initial state. 1 as the starting temperature, heats up, until the resulting analog acceptance probability greater than 90
b) the temperature drops
Temperature drop coefficient of 0.95
c) Each iteration temperature
Select a fixed number of iterations 100* n
d) the termination condition
The temperature drops to reach the number of 800, or at a temperature solution does not change
2. Run the machine and compiler environment
win7 Ultimate SP1
MINGW g++ 4.8.1 Platform: |
Size: 687104 |
Author:墨者 |
Hits:
Description: Matlab的模拟退火算法工具箱与实例，包括最经典的旅行商问题等-Matlab toolbox simulated annealing algorithm and examples, including the most classic traveling salesman problem, etc. Platform: |
Size: 62464 |
Author:王志 |
Hits:
Description: 多旅行商MTSP问题遗传算法应用遗传算法求解多旅行商问题的算法设计,并将其与模拟退火算法比较与结合,有效提高了运算的速度和效率。-Multi traveling salesman MTSP problem genetic algorithm genetic algorithm to solve the problem of multiple traveling salesman problem algorithm design, and it is compared with the simulated annealing algorithm and the combination, effectively improve the speed and efficiency of the operation. Platform: |
Size: 1646592 |
Author:zhch78 |
Hits:
Description: JAVA实现旅行商问题，有简单的可视化界面
有N个城市，要求从其中某个问题出发，唯一遍历所有城市，再回到出发的城市，求最短的路线。使用模拟退火算法可以比较快的求出TSP的一条近似最优路径。-JAVA traveling salesman problem, a simple visual interface
There are N cities, which to ask a question, the only way to traverse all cities, and then go back to the city, the shortest route. The use of simulated annealing algorithm can be faster to find an approximate optimal path TSP. Platform: |
Size: 3072 |
Author:辜丽梅 |
Hits:
Description: 通过模拟退火算法解决旅行商问题，具有较全的功能，改进算法可以直接加入其中(Through the simulated annealing algorithm to solve the traveling salesman problem, with full function, the improved algorithm can be directly added to them) Platform: |
Size: 5120 |
Author:燕子1993
|
Hits:
Description: 使用模拟退火解旅行商问题，因为这个问题本身是一个NP难问题，所以也就求不到最优解，不过应该可以求得一个比较好的解，然后再手工优化。(Using simulated annealing to solve the traveling salesman problem, because the problem itself is a NP hard problem, so it can not find the optimal solution, but it should be able to obtain a better solution, and then manually optimized.) Platform: |
Size: 1024 |
Author:Maxxxxx
|
Hits:
Description: 对于旅行商问题的求解,帮助你更好的理解模拟退火算法(The solution of the traveling salesman problem helps you better understand the simulated annealing algorithm) Platform: |
Size: 1024 |
Author:ssssasd
|
Hits:
Description: 用Java分别实现了遗传、模拟退火、BP的旅行商问题(The traveling salesman problem of heredity, simulated annealing and BP was realized by Java) Platform: |
Size: 367616 |
Author:于鱼鱼 |
Hits:
Search - salesman annealing